home *** CD-ROM | disk | FTP | other *** search
/ EuroCD 3 / EuroCD 3.iso / Programming / vbcc / machines / alpha / machine.c next >
Encoding:
C/C++ Source or Header  |  1998-06-24  |  54.4 KB  |  1,608 lines
  1. /*  Code generator for a DEC Alpha 64bit RISC cpu with 32       */
  2. /*  general purpose and 32 floating point registers.            */
  3.  
  4. #include "supp.h"
  5.  
  6. static char FILE_[]=__FILE__;
  7.  
  8. /*  Public data that MUST be there.                             */
  9.  
  10. /* Name and copyright. */
  11. char cg_copyright[]="vbcc code-generator for DEC Alpha V0.3a (c) in 1997 by Volker Barthelmann";
  12.  
  13. /*  Commandline-flags the code-generator accepts                */
  14. int g_flags[MAXGF]={VALFLAG,VALFLAG,0,0,0,0,0};
  15. char *g_flags_name[MAXGF]={"cpu","fpu","const-in-data","sd","merge-constants","g","no-builtins"};
  16. union ppi g_flags_val[MAXGF];
  17.  
  18. /*  Alignment-requirements for all types in bytes.              */
  19. zlong align[16];
  20.  
  21. /*  Alignment that is sufficient for every object.              */
  22. zlong maxalign;
  23.  
  24. /*  CHAR_BIT for the target machine.                            */
  25. zlong char_bit;
  26.  
  27. /*  Tabelle fuer die Groesse der einzelnen Typen                */
  28. zlong sizetab[16];
  29.  
  30. /*  Minimum and Maximum values each type can have.              */
  31. /*  Must be initialized in init_cg().                           */
  32. zlong t_min[32];
  33. zulong t_max[32];
  34.  
  35. /*  Names of all registers.                                     */
  36. char *regnames[MAXR+1]={"noreg",
  37.             "$0","$1","$2","$3","$4","$5","$6","$7",
  38.             "$8","$9","$10","$11","$12","$13","$14","$15",
  39.             "$16","$17","$18","$19","$20","$21","$22","$23",
  40.             "$24","$25","$26","$27","$28","$29","$30","$31",
  41.             "$f0","$f1","$f2","$f3","$f4","$f5","$f6","$f7",
  42.             "$f8","$f9","$f10","$f11","$f12","$f13","$f14","$f15",
  43.             "$f16","$f17","$f18","$f19","$f20","$f21","$f22","$f23",
  44.             "$f24","$f25","$f26","$f27","$f28","$f29","$f30","$f31"};
  45.  
  46. /*  The Size of each register in bytes.                         */
  47. zlong regsize[MAXR+1];
  48.  
  49. /*  A type which can store each register. */
  50. struct Typ *regtype[MAXR+1];
  51.  
  52. /*  regsa[reg]!=0 if a certain register is allocated and should */
  53. /*  not be used by the compiler pass.                           */
  54. int regsa[MAXR+1];
  55.  
  56. /*  Specifies which registers may be scratched by functions.    */
  57. int regscratch[MAXR+1]={0,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,
  58.               1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,1,
  59.                           1,1,0,0,0,0,0,0,0,0,1,1,1,1,1,1,
  60.                           1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1};
  61.  
  62. struct reg_handle empty_reg_handle={0};
  63.  
  64.  
  65. /****************************************/
  66. /*  Private data and functions.         */
  67. /****************************************/
  68.  
  69. static long malign[16]=  {1,1,2,4,8,4,8,1,8,1,1,1,4,1};
  70. static long msizetab[16]={1,1,2,4,8,4,8,0,8,0,0,0,4,0};
  71.  
  72. static struct Typ ltyp={LONG};
  73.  
  74. static char x_t[16]={'?','b','w','l','q','s','t','?','q'};
  75.  
  76. static int sp=31;                  /*  Stackpointer                        */
  77. static int gp=30;                  /*  Global pointer                      */
  78. static int lr=27;                  /*  Link Register                       */
  79. static int vp=28;                  /*  Virtual frame pointer               */
  80. static int r31=32;                 /*  Read as zero                        */
  81. static int f31=64;                 /*  Read as zero                        */
  82. static int sd=14;                  /*  SmallDataPointer                    */
  83. static int t1=2,t2=3,t3=4;         /*  Temporaries used by code generator  */
  84. static int t4=5,t5=6;
  85. static int f1=34,f2=35,f3=36;      /*  Temporaries used by code generator  */
  86.  
  87. #define DATA 0
  88. #define BSS 1
  89. #define CODE 2
  90.  
  91. static int section=-1,newobj,crsave,helpl,helps,stabs;
  92. static char *codename="\t.text\n",*dataname="\t.data\n",*bssname="";
  93. static int is_const(struct Typ *);
  94. static int balign(struct obj *);
  95. static char *labprefix="$C",*idprefix="";
  96. static long framesize,frameoffset;
  97. static void probj2(FILE *f,struct obj *p,int t);
  98.  
  99. #define ESGN 1
  100. #define EUNS 2
  101. static int st[MAXR+1];
  102.  
  103. static struct fpconstlist {
  104.   struct fpconstlist *next;
  105.   int label,typ;
  106.   union atyps val;
  107. } *firstfpc;
  108.  
  109. static void move_reg(FILE *f,int s,int t)
  110. {
  111.   if(t==r31||t==f31) ierror(0);  
  112.   if(s<=32&&t>32) ierror(0);
  113.   if(t<=32&&s>32) ierror(0);
  114.   if(s==t) return;
  115.   if(s<=32){
  116.     fprintf(f,"\tbis\t%s,%s,%s\n",regnames[r31],regnames[s],regnames[t]);
  117.   }else{
  118.     fprintf(f,"\tcpys\t%s,%s,%s\n",regnames[s],regnames[s],regnames[t]);
  119.   }
  120.   st[t]=st[s];
  121. }
  122.  
  123. static int addfpconst(struct obj *o,int t)
  124. {
  125.   struct fpconstlist *p=firstfpc;
  126.   t&=NQ;
  127.   if(g_flags[4]&USEDFLAG){
  128.     for(p=firstfpc;p;p=p->next){
  129.       if(t==p->typ){
  130.     eval_const(&p->val,t);
  131.     if(t==INT&&zleqto(vlong,zi2zl(o->val.vint))) return(p->label);
  132.     if(t==LONG&&zleqto(vlong,o->val.vlong)) return(p->label);
  133.     if(t==FLOAT&&zdeqto(vdouble,zf2zd(o->val.vfloat))) return(p->label);
  134.     if(t==DOUBLE&&zdeqto(vdouble,o->val.vdouble)) return(p->label);
  135.       }
  136.     }
  137.   }
  138.   p=mymalloc(sizeof(struct fpconstlist));
  139.   p->next=firstfpc;
  140.   p->label=++label;
  141.   p->typ=t;
  142.   p->val=o->val;
  143.   firstfpc=p;
  144.   return(p->label);
  145. }
  146.  
  147. #define REG_IND 1
  148. #define IMM_IND 2
  149.  
  150. static struct obj *cam(int flags,int base,int align,long offset)
  151. /*  Initializes an addressing-mode structure and returns a pointer to   */
  152. /*  that object. Will not survive a second call!                        */
  153. {
  154.   static struct obj obj;
  155.   static struct AddressingMode am;
  156.   obj.am=&am;
  157.   am.flags=flags;
  158.   am.base=base;
  159.   am.offset=offset;
  160.   am.align=align;
  161.   return(&obj);
  162. }
  163.  
  164. static char *dct[]={"??","byte","short","long","quad","long","long","quad","??","??","??","??"};
  165.  
  166. static void load_address(FILE *f,int r,struct obj *o,int typ)
  167. /*  Generates code to load the address of a variable into register r.   */
  168. {
  169.   if((o->flags&VAR)&&(o->v->storage_class==AUTO||o->v->storage_class==REGISTER)){
  170.     long of=zl2l(o->v->offset);
  171.     if(of>=0)
  172.       of+=frameoffset+zl2l(o->val.vlong);
  173.     else
  174.       of=-of-zl2l(maxalign)+framesize+zl2l(o->val.vlong);
  175.     if(of>32767) ierror(0);
  176.     fprintf(f,"\tlda\t%s,%ld(%s)\n",regnames[r],of,regnames[sp]);
  177.   }else{
  178.     fprintf(f,"\tlda\t%s,",regnames[r]);
  179.     probj2(f,o,typ);fprintf(f,"\n");
  180.   }
  181.   st[r]=ESGN;
  182. }
  183. static void load_obj(FILE *f,int r,struct obj *o,int typ,int tmp)
  184. {
  185.   int adr,shift,al;  
  186.   switch(typ&NQ){
  187.   case POINTER:
  188.   case DOUBLE:
  189.   case FLOAT:
  190.   case LONG:
  191.   case INT:
  192.     fprintf(f,"\tld%c\t%s,",x_t[typ&NQ],regnames[r]);
  193.     probj2(f,o,typ);fprintf(f,"\n");
  194.     st[r]=ESGN;return;
  195.   case SHORT:
  196.     al=balign(o);
  197.     if(al>=0){
  198.       fprintf(f,"\tldq_u\t%s,",regnames[r]);
  199.       probj2(f,o,typ);fprintf(f,"\n");
  200.       shift=64-16-al*8;
  201.       if(shift) fprintf(f,"\tsll\t%s,%d,%s\n",regnames[r],shift,regnames[r]);
  202.       if(typ&UNSIGNED){
  203.     fprintf(f,"\tsrl\t%s,%d,%s\n",regnames[r],64-16,regnames[r]);
  204.     st[r]=EUNS;
  205.       }else{
  206.     fprintf(f,"\tsra\t%s,%d,%s\n",regnames[r],64-16,regnames[r]);
  207.     st[r]=ESGN;
  208.       }
  209.       return;
  210.     }
  211.     adr=0;
  212.     if(o->am&&o->am->offset==0) 
  213.       adr=o->am->base;
  214.     else if(zleqto(o->val.vlong,l2zl(0L)))
  215.       adr=o->reg;
  216.     if(!adr){
  217.       adr=tmp;load_address(f,adr,o,POINTER);
  218.     }
  219.  
  220.     if(typ&UNSIGNED){
  221.       fprintf(f,"\tbic\t%s,6,%s\n",regnames[adr],regnames[t4]); /* ldq_u ? */
  222.       fprintf(f,"\tldq\t%s,0(%s)\n",regnames[t5],regnames[t4]);
  223.       fprintf(f,"\tbic\t%s,1,%s\n",regnames[adr],regnames[t4]);
  224.       fprintf(f,"\textwl\t%s,%s,%s\n",regnames[t5],regnames[t4],regnames[r]);
  225.       /*
  226.       fprintf(f,"\tbic\t%s,2,%s\n",regnames[adr],regnames[t4]);
  227.       fprintf(f,"\tand\t%s,2,%s\n",regnames[adr],regnames[t5]);
  228.       fprintf(f,"\tldq\t%s,0(%s)\n",regnames[r],regnames[t4]);
  229.       fprintf(f,"\textwh\t%s,%s,%s\n",regnames[r],regnames[t5],regnames[r]);
  230.       */
  231.       st[r]=EUNS;return;
  232.     }else{
  233.       fprintf(f,"\tbic\t%s,6,%s\n",regnames[adr],regnames[t4]);
  234.       fprintf(f,"\tand\t%s,6,%s\n",regnames[adr],regnames[t5]);
  235.       fprintf(f,"\tldq\t%s,0(%s)\n",regnames[r],regnames[t4]);
  236.       fprintf(f,"\tlda\t%s,2(%s)\n",regnames[t5],regnames[t5]);
  237.       fprintf(f,"\textqh\t%s,%s,%s\n",regnames[r],regnames[t5],regnames[r]);
  238.       fprintf(f,"\tsra\t%s,48,%s\n",regnames[r],regnames[r]);
  239.       st[r]=ESGN;return;
  240.     }
  241.   case CHAR:
  242.     al=balign(o);
  243.     if(al>=0){
  244.       fprintf(f,"\tldq_u\t%s,",regnames[r]);
  245.       probj2(f,o,typ);fprintf(f,"\n");
  246.       shift=64-8-al*8;
  247.       if(shift&&al) fprintf(f,"\tsll\t%s,%d,%s\n",regnames[r],shift,regnames[r]);
  248.       if(typ&UNSIGNED){
  249.     if(al==0)
  250.       fprintf(f,"\tand\t%s,255,%s\n",regnames[r],regnames[r]);
  251.     else
  252.       fprintf(f,"\tsrl\t%s,%d,%s\n",regnames[r],64-8,regnames[r]);
  253.     st[r]=EUNS;
  254.       }else{
  255.     if(al==0)
  256.       fprintf(f,"\tsextb\t%s,%s\n",regnames[r],regnames[r]);
  257.     else
  258.       fprintf(f,"\tsra\t%s,%d,%s\n",regnames[r],64-8,regnames[r]);
  259.     st[r]=ESGN;
  260.       }
  261.       return;
  262.     }
  263.     if(typ&UNSIGNED){
  264.       adr=0;
  265.       if(o->am&&o->am->offset==0) 
  266.     adr=o->am->base;
  267.       else if(zleqto(o->val.vlong,l2zl(0L)))
  268.     adr=o->reg;
  269.       if(!adr){
  270.     adr=tmp; load_address(f,adr,o,POINTER);
  271.       }
  272.       fprintf(f,"\tldq_u\t%s,0(%s)\n",regnames[r],regnames[adr]);
  273.       fprintf(f,"\textbl\t%s,%s,%s\n",regnames[r],regnames[adr],regnames[r]);
  274.       st[r]=EUNS;return;
  275.     }else{
  276.       fprintf(f,"\tldq_u\t%s,",regnames[t5]);
  277.       probj2(f,o,typ);fprintf(f,"\n\tlda\t%s,",regnames[t4]);
  278.       if(o->am) o->am->offset++; else o->val.vlong=zladd(o->val.vlong,l2zl(1L));
  279.       probj2(f,o,typ);
  280.       if(o->am) o->am->offset--; else o->val.vlong=zlsub(o->val.vlong,l2zl(1L));
  281.       fprintf(f,"\n\textqh\t%s,%s,%s\n",regnames[t5],regnames[t4],regnames[t5]);
  282.       fprintf(f,"\tsra\t%s,56,%s\n",regnames[t5],regnames[r]);
  283.       st[r]=ESGN;return;
  284.     }
  285.   }
  286.   ierror(0);
  287. }
  288. static void load_reg(FILE *f,int r,struct obj *o,int typ,int tmp)
  289. /*  Generates code to load a memory object into register r. tmp is a    */
  290. /*  general purpose register which may be used. tmp can be r.           */
  291. {
  292.   typ&=NU;
  293.   if(o->am){
  294.     load_obj(f,r,o,typ,tmp);
  295.     return;
  296.   }
  297.   if(o->flags&KONST){
  298.     long l;int lab;
  299.     eval_const(&o->val,typ);
  300.     if(typ==FLOAT||typ==DOUBLE){
  301.       lab=addfpconst(o,typ);
  302.       fprintf(f,"\tlda\t%s,%s%d\n",regnames[tmp],labprefix,lab);
  303.       fprintf(f,"\tld%c\t%s,0(%s)\n",x_t[typ&NQ],regnames[r],regnames[tmp]);
  304.       st[r]=ESGN;
  305.       return;
  306.     }
  307.     if(zlleq(vlong,l2zl(32767))&&zlleq(l2zl(-32768),vlong)){
  308.       fprintf(f,"\tlda\t%s,%ld(%s)\n",regnames[r],zl2l(vlong),regnames[r31]);
  309.     }else{
  310. /*       if((typ&NQ)<INT) ierror(0); */
  311.       lab=addfpconst(o,typ);
  312.       fprintf(f,"\tlda\t%s,%s%d\n",regnames[tmp],labprefix,lab);
  313.       fprintf(f,"\tldq\t%s,0(%s)\n",regnames[r],regnames[tmp]);
  314.     }
  315.     st[r]=ESGN;
  316.     return;
  317.   }
  318.   if((o->flags&VAR)&&(o->v->storage_class==EXTERN||o->v->storage_class==STATIC)){
  319.     if(!(o->flags&VARADR)){
  320.       load_address(f,tmp,o,POINTER);
  321.       load_obj(f,r,cam(IMM_IND,tmp,balign(o),0L),typ,tmp);
  322.     }else{
  323.       load_address(f,r,o,POINTER);
  324.     }
  325.   }else{
  326.     if(o->am||(o->flags&(DREFOBJ|REG))==REG){
  327.       if(r!=o->reg)
  328.     move_reg(f,o->reg,r);
  329.     }else{
  330.       if(o->flags&DREFOBJ) ierror(0);
  331.       load_obj(f,r,o,typ,tmp);
  332.     }
  333.   }
  334. }
  335.  
  336.  
  337. static void store_reg(FILE *f,int r,struct obj *o,int typ)
  338. /*  Generates code to store register r into memory object o.            */
  339. {
  340.   int adr,t6,t7;
  341.   if((o->flags&(REG|DREFOBJ))==REG) ierror(0);
  342.   if(r==t1){ t6=t2;t7=t3;}
  343.   else if(r==t2) {t6=t1;t7=t3;}
  344.   else {t6=t1;t7=t2;}
  345.   if((typ&NQ)>SHORT){
  346.     if((o->flags&VAR)&&(o->v->storage_class==EXTERN||o->v->storage_class==STATIC)){
  347.       load_address(f,t6,o,POINTER);
  348.       fprintf(f,"\tst%c\t%s,0(%s)\n",x_t[typ&NQ],regnames[r],regnames[t6]);
  349.       return;
  350.     }
  351.     fprintf(f,"\tst%c\t%s,",x_t[typ&NQ],regnames[r]);
  352.     probj2(f,o,typ);fprintf(f,"\n");
  353.     return;
  354.   }else{
  355.     adr=0;
  356.     if(o->am&&o->am->offset==0) 
  357.       adr=o->am->base;
  358.     else if(zleqto(o->val.vlong,l2zl(0L)))
  359.       adr=o->reg;
  360.     if(!adr){
  361.       adr=t7; load_address(f,adr,o,POINTER);
  362.     } 
  363.     if((typ&NQ)==SHORT){
  364.       fprintf(f,"\tbic\t%s,2,%s\n",regnames[adr],regnames[t4]);
  365.       fprintf(f,"\tldl\t%s,0(%s)\n",regnames[t6],regnames[t4]);
  366.       fprintf(f,"\tand\t%s,2,%s\n",regnames[adr],regnames[t5]);
  367.       fprintf(f,"\tmskwl\t%s,%s,%s\n",regnames[t6],regnames[t5],regnames[t6]);
  368.       fprintf(f,"\tinswl\t%s,%s,%s\n",regnames[r],regnames[t5],regnames[t7]);
  369.       fprintf(f,"\tbis\t%s,%s,%s\n",regnames[t6],regnames[t7],regnames[t6]);
  370.       fprintf(f,"\tstl\t%s,0(%s)\n",regnames[t6],regnames[t4]);
  371.       return;
  372.     }else{
  373.       fprintf(f,"\tldq_u\t%s,0(%s)\n",regnames[t4],regnames[adr]);
  374.       fprintf(f,"\tmskbl\t%s,%s,%s\n",regnames[t4],regnames[adr],regnames[t4]);
  375.       fprintf(f,"\tinsbl\t%s,%s,%s\n",regnames[r],regnames[adr],regnames[t5]);
  376.       fprintf(f,"\tbis\t%s,%s,%s\n",regnames[t4],regnames[t5],regnames[t4]);
  377.       fprintf(f,"\tstq_u\t%s,0(%s)\n",regnames[t4],regnames[adr]);
  378.       return;
  379.     }
  380.   }   
  381. }
  382.  
  383. static void extend(FILE *f,int r)
  384. {
  385.   if(!r) return;
  386.   if(st[r]==ESGN) return;
  387.   fprintf(f,"\taddl\t%s,%s,%s\n",regnames[r],regnames[r31],regnames[r]);
  388.   st[r]=ESGN;
  389. }
  390. static void uextend(FILE *f,int r)
  391. {
  392.   if(!r) return;
  393.   if(st[r]==EUNS) return;
  394.   fprintf(f,"\tzapnot\t%s,15,%s\n",regnames[r],regnames[r]);
  395.   st[r]=EUNS;
  396. }
  397.  
  398. static struct IC *do_refs(FILE *,struct IC *);
  399. static void pr(FILE *,struct IC *);
  400. static void function_top(FILE *,struct Var *,long,long);
  401. static void function_bottom(FILE *f,struct Var *,long,long);
  402.  
  403. #define isreg(x) ((p->x.flags&(REG|DREFOBJ))==REG)
  404.  
  405. static int q1reg,q2reg,zreg;
  406.  
  407. static char *ccs[]={"eq","ne","lt","ge","le","gt",""};
  408. static char *logicals[]={"bis","xor","and"};
  409. static char *arithmetics[]={"sll","srl","add","sub","mul","div","rem"};
  410.  
  411. static struct IC *do_refs(FILE *f,struct IC *p)
  412. /*  Does some pre-processing like fetching operands from memory to      */
  413. /*  registers etc.                                                      */
  414. {
  415.   int typ=p->typf,typ1,reg,c=p->code;
  416.   
  417.   if(c==CONVCHAR) typ=CHAR;
  418.   if(c==CONVUCHAR) typ=UNSIGNED|CHAR;
  419.   if(c==CONVSHORT) typ=SHORT;
  420.   if(c==CONVUSHORT) typ=UNSIGNED|SHORT;
  421.   if(c==CONVINT) typ=INT;
  422.   if(c==CONVUINT) typ=UNSIGNED|INT;
  423.   if(c==CONVLONG) typ=LONG;
  424.   if(c==CONVULONG) typ=UNSIGNED|LONG;
  425.   if(c==CONVFLOAT) typ=FLOAT;
  426.   if(c==CONVDOUBLE) typ=DOUBLE;
  427.   if(c==CONVPOINTER) typ=UNSIGNED|LONG;
  428.   
  429.   q1reg=q2reg=zreg=0;
  430.   if(p->q1.flags®) q1reg=p->q1.reg;
  431.   if(p->q2.flags®) q2reg=p->q2.reg;
  432.   if((p->z.flags&(REG|DREFOBJ))==REG) zreg=p->z.reg;
  433.   
  434.  
  435.   if((p->q1.flags&(KONST|DREFOBJ))==KONST){
  436.     eval_const(&p->q1.val,typ);
  437.     if(zleqto(vlong,l2zl(0L))&&zuleqto(vulong,ul2zul(0UL))&&zdeqto(vdouble,d2zd(0.0))){
  438.       if((typ&NQ)==FLOAT||(typ&NQ)==DOUBLE) q1reg=f31; else q1reg=r31;
  439.     }else{
  440.       if((typ&NQ)==FLOAT||(typ&NQ)==DOUBLE) reg=f1; else reg=t1;
  441.       if(c==ASSIGN&&zreg) reg=zreg;
  442.       if(c==SETRETURN&&p->z.reg) reg=p->z.reg;
  443.       if((c==MOD||c==DIV)&&(typ&NQ)<=LONG&&!regs[25]) reg=25; /* Linux-div */
  444.       if((typ&NQ)==FLOAT||(typ&NQ)==DOUBLE||c==DIV||c==SUB||c==ASSIGN||c==PUSH||c==SETRETURN||c==LSHIFT||c==RSHIFT||c==COMPARE){
  445.     load_reg(f,reg,&p->q1,typ,t1);
  446.     q1reg=reg;
  447.       }else{
  448.     if((typ&NQ)<=LONG){
  449.       if(!zulleq(vlong,l2zl(255L))||!zlleq(vlong,l2zl(255))||zlleq(vlong,l2zl(-1L))){
  450.         load_reg(f,reg,&p->q2,typ,t1);
  451.         q1reg=reg;
  452.       }    
  453.     }
  454.       }
  455.     }
  456.   }else if(c!=ADDRESS){
  457.     if(p->q1.flags&&!q1reg){
  458.       if((typ&NQ)==FLOAT||(typ&NQ)==DOUBLE) reg=f1; else reg=t1;
  459.       if((c==ASSIGN||(c>=CONVCHAR&&c<=CONVULONG))&&zreg&&(reg-r31)*(zreg-r31)>0) reg=zreg;
  460.       if(c==SETRETURN&&p->z.reg) reg=p->z.reg;
  461.       if((p->q1.flags&DREFOBJ)||c==ADDI2P||c==SUBIFP) {typ1=POINTER;reg=t1;} else typ1=typ;
  462.       if(c==CALL) reg=vp;
  463.       if((c==MOD||c==DIV)&&(typ1&NQ)<=LONG&&!regs[25]) reg=25; /* Linux-div */
  464.       if((typ1&NQ)<=POINTER){
  465.     int m=p->q1.flags;
  466.     p->q1.flags&=~DREFOBJ;
  467.     load_reg(f,reg,&p->q1,typ1,t1);
  468.     p->q1.flags=m;
  469.     q1reg=reg;
  470.       }
  471.     }
  472.     if((p->q1.flags&DREFOBJ)&&(typ&NQ)<=POINTER){
  473.       if((typ&NQ)==FLOAT||(typ&NQ)==DOUBLE) reg=f1; else reg=t1;
  474.       if((c==ASSIGN||(c>=CONVCHAR&&c<=CONVULONG))&&zreg&®ok(zreg,typ,0)) reg=zreg;
  475.       if(c==SETRETURN&&p->z.reg) reg=p->z.reg;
  476.       if((c==MOD||c==DIV)&&(typ&NQ)<=LONG&&!regs[25]) reg=25; /* Linux-div */
  477.       if(c==ADDI2P||c==SUBIFP) 
  478.     load_reg(f,reg,cam(IMM_IND,q1reg,-1,0),POINTER,t1);
  479.       else
  480.     load_reg(f,reg,cam(IMM_IND,q1reg,-1,0),typ,t1);
  481.       q1reg=reg;
  482.     }
  483.   }
  484.   if((p->q2.flags&(KONST|DREFOBJ))==KONST){
  485.     eval_const(&p->q2.val,typ);
  486.     if(zleqto(vlong,l2zl(0L))&&zuleqto(vulong,ul2zul(0UL))&&zdeqto(vdouble,d2zd(0.0))){
  487.       if((typ&NQ)==FLOAT||(typ&NQ)==DOUBLE) q2reg=f31; else q2reg=r31;
  488.     }else{
  489.       if((typ&NQ)==FLOAT||(typ&NQ)==DOUBLE) reg=f2; else reg=t2;
  490.       if((c==MOD||c==DIV)&&(typ&NQ)<=LONG&&!regs[26]) reg=26; /* Linux-div */
  491.       if((typ&NQ)==FLOAT||(typ&NQ)==DOUBLE){
  492.     load_reg(f,reg,&p->q2,typ,t2);
  493.     q2reg=reg;
  494.       }else{
  495.     if((typ&NQ)<=LONG){    
  496.       if(!zulleq(vlong,l2zl(255L))||!zlleq(vlong,l2zl(255L))||zlleq(vlong,l2zl(-1L))){
  497.         load_reg(f,reg,&p->q2,typ,t2);
  498.         q2reg=reg;
  499.       }
  500.     }
  501.       }
  502.     }
  503.   }else{
  504.     if(p->q2.flags&&!q2reg){
  505.       if(p->q2.flags&DREFOBJ) typ1=POINTER; else typ1=typ;
  506.       if((typ1&NQ)==FLOAT||(typ1&NQ)==DOUBLE) reg=f2; else reg=t2;
  507.       if((c==MOD||c==DIV)&&(typ1&NQ)<=LONG&&!regs[26]) reg=26; /* Linux-div */
  508.       if((typ1&NQ)<=POINTER){
  509.     int m=p->q2.flags;
  510.     p->q2.flags&=~DREFOBJ;
  511.     load_reg(f,reg,&p->q2,typ1,t2);
  512.     p->q2.flags=m;
  513.     q2reg=reg;
  514.       }
  515.     }
  516.     if((p->q2.flags&DREFOBJ)&&(typ&NQ)<=POINTER){
  517.       if((typ&NQ)==FLOAT||(typ&NQ)==DOUBLE) reg=f2; else reg=t2;
  518.       if((c==MOD||c==DIV)&&(typ&NQ)<=LONG&&!regs[26]) reg=26; /* Linux-div */
  519.       load_reg(f,reg,cam(IMM_IND,q2reg,-1,0),typ,t2);
  520.       q2reg=reg;
  521.     }
  522.   }
  523.   if(p->z.flags&&!isreg(z)){
  524.     typ=p->typf;
  525.     if((typ&NQ)==FLOAT||(typ&NQ)==DOUBLE) zreg=f3; else zreg=t3;
  526.     if((c==MOD||c==DIV)&&(typ&NQ)<=LONG&&!regs[28]) zreg=28; /* Linux-div */
  527.   }
  528.   if(q1reg){ p->q1.flags=REG; p->q1.reg=q1reg;}
  529.   if(q2reg){ p->q2.flags=REG; p->q2.reg=q2reg;}
  530.   return(p);
  531. }
  532. static long pof2(zulong x)
  533. /*  Yields log2(x)+1 oder 0. */
  534. {
  535.     zulong p;int ln=1;
  536.     p=ul2zul(1L);
  537.     while(ln<=64&&zulleq(p,x)){
  538.         if(zuleqto(x,p)) return(ln);
  539.         ln++;p=zuladd(p,p);
  540.     }
  541.     return(0);
  542. }
  543. static void pr(FILE *f,struct IC *p)
  544. /*  Writes the destination register to the real destination if necessary.   */
  545. {
  546.   int typ=p->typf;
  547.   if(p->z.flags){
  548.     if(p->code==ADDRESS||p->code==ADDI2P||p->code==SUBIFP) typ=POINTER;
  549.     if(!isreg(z)){
  550.       if(p->z.flags&DREFOBJ){
  551.     if(p->z.flags®){
  552.       store_reg(f,zreg,cam(IMM_IND,p->z.reg,-1,0),typ);
  553.     }else{
  554.       int r,m;
  555.       if(t1==zreg) r=t2; else r=t1;
  556.       m=p->z.flags;
  557.       p->z.flags&=~DREFOBJ;
  558.       load_reg(f,r,&p->z,POINTER,r);
  559.       p->z.flags=m;
  560.       store_reg(f,zreg,cam(IMM_IND,r,balign(&p->z),0),typ);
  561.     }
  562.       }else{
  563.     store_reg(f,zreg,&p->z,typ);
  564.       }
  565.     }else{
  566.       if(p->z.reg!=zreg)
  567.     move_reg(f,zreg,p->z.reg);
  568.     }
  569.   }
  570. }
  571.  
  572. static void probj2(FILE *f,struct obj *p,int t)
  573. /*  Prints an object.                               */
  574. {
  575.   if(p->am){
  576.     if(p->am->flags==REG_IND) ierror(0);
  577.     if(p->am->flags==IMM_IND) fprintf(f,"%ld(%s)",p->am->offset,regnames[p->am->base]);
  578.     return;
  579.   }
  580.   if(p->flags&DREFOBJ) fprintf(f,"(");
  581.   if(p->flags&VAR) {
  582.     if(p->v->storage_class==AUTO||p->v->storage_class==REGISTER){
  583.       if(p->flags®){
  584.     fprintf(f,"%s",regnames[p->reg]);
  585.       }else{
  586.     long of=zl2l(p->v->offset);
  587.     if(of>=0)
  588.       of+=frameoffset+zl2l(p->val.vlong);
  589.     else
  590.       of=-of-zl2l(maxalign)+framesize+zl2l(p->val.vlong);
  591.     if(of>32767) ierror(0);
  592.     fprintf(f,"%ld(%s)",of,regnames[sp]);
  593.       }
  594.     }else{
  595.       if(!zleqto(l2zl(0L),p->val.vlong)){printval(f,&p->val,LONG,0);fprintf(f,"+");}
  596.       if(p->v->storage_class==STATIC&&(p->v->vtyp->flags&NQ)!=FUNKT){
  597.     fprintf(f,"%s%ld",labprefix,zl2l(p->v->offset));
  598.       }else{
  599.     fprintf(f,"%s%s",idprefix,p->v->identifier);
  600.       }
  601.     }
  602.   }
  603.   if((p->flags®)&&!(p->flags&VAR)) fprintf(f,"%s",regnames[p->reg]);
  604.   if(p->flags&KONST){
  605.     printval(f,&p->val,t&NU,0);
  606.   }
  607.   if(p->flags&DREFOBJ) fprintf(f,")");
  608. }
  609. static void function_top(FILE *f,struct Var *v,long offset,long maxpushed)
  610. /*  Generates function top.                             */
  611. {
  612.   int i;
  613.    fprintf(f,"\t.set\tnoat\n"); 
  614.   if(section!=CODE){fprintf(f,codename);section=CODE;}
  615.   if(v->storage_class==EXTERN) fprintf(f,"\t.global\t%s%s\n",idprefix,v->identifier);
  616.   fprintf(f,"\t.ent\t%s%s\n",idprefix,v->identifier);
  617.   fprintf(f,"%s%s:\n",idprefix,v->identifier);
  618.   if(function_calls) fprintf(f,"\tldgp\t%s,0(%s)\n",regnames[gp],regnames[vp]);
  619.   fprintf(f,"%s%s..ng:\n",idprefix,v->identifier);
  620.   framesize=offset+maxpushed;
  621.   if(function_calls) framesize+=8; /* lr */
  622.   for(i=1;i<=MAXR;i++)
  623.     if(regused[i]&&!regscratch[i]&&!regsa[i]) 
  624.       framesize+=8;
  625.   framesize=((framesize+16-1)/16)*16;
  626.   if(framesize>32767) ierror(0);
  627.   if(framesize) fprintf(f,"\tlda\t%s,%ld(%s)\n",regnames[sp],-framesize,regnames[sp]);
  628.   fprintf(f,"\t.frame\t%s,%ld,%s,0\n",regnames[sp],framesize,regnames[lr]);
  629.   frameoffset=maxpushed;
  630.   if(function_calls){
  631.     fprintf(f,"\tstq\t%s,%ld(%s)\n",regnames[lr],frameoffset,regnames[sp]);
  632.     frameoffset+=8;
  633.   }
  634.   for(i=1;i<=MAXR;i++){
  635.     if(regused[i]&&!regscratch[i]&&!regsa[i]){
  636.       if(i<=32){
  637.     fprintf(f,"\tstq\t%s,%ld(%s)\n",regnames[i],frameoffset,regnames[sp]);
  638.       }else{
  639.     fprintf(f,"\tstt\t%s,%ld(%s)\n",regnames[i],frameoffset,regnames[sp]);
  640.       }
  641.       frameoffset+=8;
  642.     }
  643.   }
  644.   fprintf(f,"\t.mask\t0x4000000,%ld\n",-framesize);
  645.   fprintf(f,"\t.prologue\t%c\n",function_calls?'1':'0');
  646. }
  647. static void function_bottom(FILE *f,struct Var *v,long offset,long maxpushed)
  648. /*  Generates function bottom.                          */
  649. {
  650.   int i;
  651.   frameoffset=maxpushed;
  652.   if(function_calls){
  653.     fprintf(f,"\tldq\t%s,%ld(%s)\n",regnames[lr],frameoffset,regnames[sp]);
  654.     frameoffset+=8;
  655.   }
  656.   for(i=1;i<=MAXR;i++){
  657.     if(regused[i]&&!regscratch[i]&&!regsa[i]){
  658.       if(i<=32){
  659.     fprintf(f,"\tldq\t%s,%ld(%s)\n",regnames[i],frameoffset,regnames[sp]);
  660.       }else{
  661.     fprintf(f,"\tldt\t%s,%ld(%s)\n",regnames[i],frameoffset,regnames[sp]);
  662.       }
  663.       frameoffset+=8;
  664.     }
  665.   }  
  666.   if(framesize) fprintf(f,"\tlda\t%s,%ld(%s)\n",regnames[sp],framesize,regnames[sp]);
  667.   fprintf(f,"\tret\t%s,(%s),1\n",regnames[r31],regnames[lr]);
  668.   fprintf(f,"\t.end\t%s%s\n",idprefix,v->identifier);
  669.   fprintf(f,"\t.type\t%s%s,@function\n",idprefix,v->identifier);
  670.   fprintf(f,"\t.size\t%s%s,$-%s%s\n",idprefix,v->identifier,idprefix,v->identifier);
  671. }
  672. static int is_const(struct Typ *t)
  673. /*  Tests if a type can be placed in the code-section.  */
  674. {
  675.   if(!(t->flags&(CONST|STRINGCONST))){
  676.     do{
  677.       if(t->flags&(CONST|STRINGCONST)) return(1);
  678.       if((t->flags&NQ)!=ARRAY) return(0);
  679.       t=t->next;
  680.     }while(1);
  681.   }else return(1);
  682. }
  683. static int balign(struct obj *o)
  684. /*  Liefert die unteren 3 Bits des Objekts. -1 wenn unklar. */
  685. {
  686.   int sc;
  687.   if(o->flags&DREFOBJ) return -1;
  688.   if(o->am) return o->am->align;
  689.   if(!(o->flags&VAR)) ierror(0);
  690.   sc=o->v->storage_class;
  691.   if(sc==EXTERN||sc==STATIC){
  692.     /* Alle statischen Daten werden vom cg auf 64bit alignt. */
  693.     return zl2l(zland(o->val.vlong,l2zl(7L)));
  694.   }
  695.   if(sc==AUTO||sc==REGISTER){
  696.     zlong of=o->v->offset;
  697.     if(!zlleq(l2zl(0L),of))
  698.       of=zlsub(l2zl(0L),zladd(of,maxalign));
  699.     return zl2l(zland(zladd(of,o->val.vlong),l2zl(7L)));
  700.   }
  701.   ierror(0);
  702. }
  703.  
  704. /* Routinen fuer Debug-Informationen mit stabs. */
  705.  
  706. static int debug_blabel,debug_elabel;
  707. static int debug_type(FILE *,struct Typ *);
  708. static void debug_init(FILE *,struct Var *);
  709. static void debug_exit(FILE *,struct Var *);
  710. static void debug_var(FILE *,struct obj *);
  711. static void debug_IC(FILE *,struct IC *);
  712. static void debug_cleanup(FILE *);
  713.  
  714. static int debug_type(FILE *f,struct Typ *t)
  715.      /* Liefert Typindex.  */
  716. {
  717.   return t->flags&NU;
  718. }
  719. static void debug_init(FILE *f,struct Var *v)
  720.      /* Debug-Infos. Wird am Anfang von gen_code aufgerufen. */
  721. {
  722.   static int did_header;
  723.   if(!did_header){
  724.     fprintf(f,"\t.stabs \"\",100,0,0,%stext0\n",labprefix);
  725.     fprintf(f,"\t.stabs \"%s\",100,0,0,%stext0\n",errfname,labprefix);
  726.     fprintf(f,"\t.text\n%stext0:\n",labprefix);section=CODE;
  727.     fprintf(f,"\t.stabs\t\"char:t%d=r1;-128;127;\",128,0,0,0\n",CHAR);
  728.     fprintf(f,"\t.stabs\t\"short:t%d=r1;-32768;32767;\",128,0,0,0\n",SHORT);
  729.     fprintf(f,"\t.stabs\t\"int:t%d=r1;-2147483648;2147483647;\",128,0,0,0\n",INT);
  730.     fprintf(f,"\t.stabs\t\"long:t%d=r1;001000000000000000000000;000777777777777777777777;\",128,0,0,0\n",LONG);
  731.     fprintf(f,"\t.stabs\t\"unsigned char:t%d=r1;0;255;\",128,0,0,0\n",UNSIGNED|CHAR);
  732.     fprintf(f,"\t.stabs\t\"unsigned short:t%d=r1;0;65535;\",128,0,0,0\n",UNSIGNED|SHORT);
  733.     fprintf(f,"\t.stabs\t\"unsigned int:t%d=r1;0;-1;\",128,0,0,0\n",UNSIGNED|INT);
  734.     fprintf(f,"\t.stabs\t\"unsigned long:t%d=r1;0;-1;\",128,0,0,0\n",UNSIGNED|LONG);
  735.     fprintf(f,"\t.stabs\t\"float:t%d=r1;4;0;\",128,0,0,0\n",FLOAT);
  736.     fprintf(f,"\t.stabs\t\"double:t%d=r1;8;0;\",128,0,0,0\n",DOUBLE);
  737.     fprintf(f,"\t.stabs\t\"void:t%d=%d;8;0;\",128,0,0,0\n",VOID,VOID);
  738.     did_header=1;
  739.   }
  740.   fprintf(f,"\t.stabs\t\"%s:F%d\",36,0,0,%s%s\n",v->identifier,debug_type(f,v->vtyp->next),idprefix,v->identifier);
  741.   debug_blabel=++label;debug_elabel=++label;
  742. }
  743. static void debug_exit(FILE *f,struct Var *v)
  744.      /* Debug-Infos. Wird am Ende von gen_code aufgerufen. */
  745. {
  746.   struct IC *p;
  747.   fprintf(f,"\t.stabn\t192,0,0,%s%d\n",labprefix,debug_blabel);
  748.   fprintf(f,"\t.stabn\t224,0,0,%s%d\n",labprefix,debug_elabel);
  749.   for(p=first_ic;p;p=p->next){
  750.     if(p->q1.flags&VAR) debug_var(f,&p->q1);
  751.     if(p->q2.flags&VAR) debug_var(f,&p->q2);
  752.     if(p->z.flags&VAR) debug_var(f,&p->z);
  753.   }
  754. }
  755. static void debug_var(FILE *f,struct obj *o)
  756.      /* Debug-Infos fuer eine Variable ausgeben. */
  757. {
  758.   struct Var *v=o->v; int td;
  759.   if(!*v->identifier) return;
  760.   td=debug_type(f,v->vtyp);
  761.   if(td==FUNKT) return;
  762.   if(o->flags®){
  763.     fprintf(f,"\t.stabs\t\"%s:r%d\",0x40,0,0,%d\n",v->identifier,td,o->reg-1);
  764.     return;
  765.   }
  766.   if(v->storage_class==AUTO||v->storage_class==REGISTER){
  767.     long of=zl2l(v->offset);
  768.     if(!zlleq(l2zl(0L),v->offset)){
  769.       of=-of-zl2l(maxalign)+framesize;
  770.       fprintf(f,"#\toffset %ld:\n",of);
  771.       fprintf(f,"\t.stabs\t\"%s:p%d\",0x80,0,0,%ld\n",v->identifier,td,of-framesize);
  772.     }else{
  773.       of+=frameoffset;
  774.       fprintf(f,"#\toffset %ld:\n",of);
  775.       fprintf(f,"\t.stabs\t\"%s:%d\",0x80,0,0,%ld\n",v->identifier,td,of-framesize);
  776.     }
  777.     return;
  778.   }
  779.   ierror(td);
  780. }
  781. static void debug_IC(FILE *f,struct IC *p)
  782.      /* Debug-Infos. Wird fuer jedes IC aufgerufen. */
  783. {
  784.   static int lastline;int lab;
  785.   printf("%d",p->line);pric2(stdout,p);
  786.   if(!p->prev)
  787.     fprintf(f,"%s%d:\n",labprefix,debug_blabel);
  788. /*   if(p->q1.flags&VAR) debug_var(f,&p->q1); */
  789. /*   if(p->q2.flags&VAR) debug_var(f,&p->q2); */
  790. /*   if(p->z.flags&VAR) debug_var(f,&p->z); */
  791.   if(p->line&&p->line!=lastline){
  792.     lab=++label;lastline=p->line;
  793.     fprintf(f,"%s%d:\n",labprefix,lab);
  794.     fprintf(f,"\t.stabn\t68,0,%d,%s%d\n",lastline,labprefix,lab);
  795.   }
  796.   if(!p->next) fprintf(f,"%s%d:\n",labprefix,debug_elabel);
  797. }
  798. static void debug_cleanup(FILE *f)
  799.      /* Debug-Infos. Wird in cleanup_cg aufgerufen. */
  800. {
  801. }
  802.  
  803.  
  804. /****************************************/
  805. /*  End of private data and functions.  */
  806. /****************************************/
  807.  
  808.  
  809. int init_cg(void)
  810. /*  Does necessary initializations for the code-generator. Gets called  */
  811. /*  once at the beginning and should return 0 in case of problems.      */
  812. {
  813.   int i;
  814.   /*  Initialize some values which cannot be statically initialized   */
  815.   /*  because they are stored in the target's arithmetic.             */
  816.   maxalign=l2zl(8L);
  817.   char_bit=l2zl(8L);
  818.   for(i=0;i<16;i++){
  819.     sizetab[i]=l2zl(msizetab[i]);
  820.     align[i]=l2zl(malign[i]);
  821.   }
  822.   for(i= 1;i<=32;i++) {regsize[i]=l2zl(8L);regtype[i]=<yp;}
  823.   for(i=33;i<=64;i++) {regsize[i]=l2zl(8L);regtype[i]=<yp;}
  824.   
  825.   /*  Use multiple ccs.   */
  826.   multiple_ccs=0; /* not yet */
  827.   
  828.   /*  Initialize the min/max-settings. Note that the types of the     */
  829.   /*  host system may be different from the target system and you may */
  830.   /*  only use the smallest maximum values ANSI guarantees if you     */
  831.   /*  want to be portable.                                            */
  832.   /*  That's the reason for the subtraction in t_min[INT]. Long could */
  833.   /*  be unable to represent -2147483648 on the host system.          */
  834.   t_min[UNSIGNED|CHAR]=t_min[UNSIGNED|SHORT]=t_min[UNSIGNED|INT]=t_min[UNSIGNED|LONG]=l2zl(0L);
  835.   t_min[CHAR]=l2zl(-128L);
  836.   t_min[SHORT]=l2zl(-32768L);
  837.   t_min[INT]=zlsub(l2zl(-2147483647L),l2zl(1L));
  838.   t_min[LONG]=zllshift(l2zl(-1L),l2zl(63L));
  839.   t_max[CHAR]=ul2zul(127UL);
  840.   t_max[SHORT]=ul2zul(32767UL);
  841.   t_max[INT]=ul2zul(2147483647UL);
  842.   t_max[LONG]=zulsub(zulrshift(ul2zul(1UL),ul2zul(63UL)),ul2zul(1UL));
  843.   t_max[UNSIGNED|CHAR]=ul2zul(255UL);
  844.   t_max[UNSIGNED|SHORT]=ul2zul(65535UL);
  845.   t_max[UNSIGNED|INT]=ul2zul(4294967295UL);
  846.   t_max[UNSIGNED|LONG]=zulkompl(ul2zul(0UL));
  847.   /*  Reserve a few registers for use by the code-generator.      */
  848.   /*  This is not optimal but simple.                             */
  849.   regsa[t1]=regsa[t2]=regsa[t3]=regsa[t4]=regsa[t5]=1;
  850.   regsa[f1]=regsa[f2]=regsa[f3]=1;
  851.   regsa[sp]=regsa[gp]=regsa[sd]=1;
  852.   regsa[lr]=regsa[r31]=regsa[f31]=1;
  853.   regscratch[t1]=regscratch[t2]=regscratch[t3]=regscratch[t4]=regscratch[t5]=0;
  854.   regscratch[f1]=regscratch[f2]=regscratch[f3]=0;
  855.   regscratch[sp]=regscratch[gp]=regscratch[sd]=0;
  856.   regscratch[lr]=regscratch[r31]=regscratch[f31]=0;
  857.   /* reserve at - noch aendern */
  858.   /* regsa[29]=1;regscratch[29]=0; */
  859.   /* Debug stabs? */
  860.   stabs=(g_flags[5]&USEDFLAG);
  861.   return(1);
  862. }
  863.  
  864. int freturn(struct Typ *t)
  865. /*  Returns the register in which variables of type t are returned. */
  866. /*  If the value cannot be returned in a register returns 0.        */
  867. /*  A pointer MUST be returned in a register. The code-generator    */
  868. /*  has to simulate a pseudo register if necessary.                 */
  869. {
  870.   if((t->flags&NQ)==FLOAT||(t->flags&NQ)==DOUBLE) return(33);
  871.   if((t->flags&NQ)==STRUCT||(t->flags&NQ)==UNION) return(0);
  872.   if(zlleq(szof(t),l2zl(8L))) return(1); else return(0);
  873. }
  874.  
  875. int regok(int r,int t,int mode)
  876. /*  Returns 0 if register r cannot store variables of   */
  877. /*  type t. If t==POINTER and mode!=0 then it returns   */
  878. /*  non-zero only if the register can store a pointer   */
  879. /*  and dereference a pointer to mode.                  */
  880. {
  881.   if(r==0) return(0);
  882.   t&=NQ;
  883.   if(t==0) return(0);
  884.   if((t==FLOAT||t==DOUBLE)&&r>=33&&r<=64) return(1);
  885.   if(t==POINTER&&r>=1&&r<=32) return(1);
  886.   if(t>=CHAR&&t<=LONG&&r>=1&&r<=32) return(1);
  887.   return(0);
  888. }
  889.  
  890. int dangerous_IC(struct IC *p)
  891. /*  Returns zero if the IC p can be safely executed     */
  892. /*  without danger of exceptions or similar things.     */
  893. /*  vbcc may generate code in which non-dangerous ICs   */
  894. /*  are sometimes executed although control-flow may    */
  895. /*  never reach them (mainly when moving computations   */
  896. /*  out of loops).                                      */
  897. /*  Typical ICs that generate exceptions on some        */
  898. /*  machines are:                                       */
  899. /*      - accesses via pointers                         */
  900. /*      - division/modulo                               */
  901. /*      - overflow on signed integer/floats             */
  902. {
  903.   int c=p->code;
  904.   if((p->q1.flags&DREFOBJ)||(p->q2.flags&DREFOBJ)||(p->z.flags&DREFOBJ))
  905.     return(0);
  906.   if((c==DIV||c==MOD)&&!(p->q2.flags&KONST))
  907.     return(1);
  908.   return(0);
  909. }
  910.  
  911. int must_convert(np p,int t)
  912. /*  Returns zero if code for converting np to type t    */
  913. /*  can be omitted.                                     */
  914. /*  On the PowerPC cpu pointers and 32bit               */
  915. /*  integers have the same representation and can use   */
  916. /*  the same registers.                                 */
  917. {
  918.   int o=p->ntyp->flags,op=o&NQ,tp=t&NQ;
  919.   if(zleqto(sizetab[tp],sizetab[op])&&op!=FLOAT&&tp!=FLOAT&&op!=DOUBLE&&tp!=DOUBLE) return(0);  
  920.   return(1);
  921. }
  922.  
  923. void gen_ds(FILE *f,zlong size,struct Typ *t)
  924. /*  This function has to create <size> bytes of storage */
  925. /*  initialized with zero.                              */
  926. {
  927.   if(newobj){
  928.    size=zlmult(zldiv(zladd(size,l2zl(7L)),l2zl(8L)),l2zl(8L));
  929.     printzl(f,size);
  930.   }else{
  931.     fprintf(f,"\t.zero\t");
  932.     printzl(f,size);
  933.   }
  934.   fprintf(f,"\n");
  935.   newobj=0;
  936. }
  937.  
  938. void gen_align(FILE *f,zlong align)
  939. /*  This function has to make sure the next data is     */
  940. /*  aligned to multiples of <align> bytes.              */
  941. {
  942.   fprintf(f,"\t.align\t3\n");
  943. }
  944.  
  945. void gen_var_head(FILE *f,struct Var *v)
  946. /*  This function has to create the head of a variable  */
  947. /*  definition, i.e. the label and information for      */
  948. /*  linkage etc.                                        */
  949. {
  950.   int constflag;
  951.   fprintf(f,"\t.align\t3\n");
  952.   if(v->clist) constflag=is_const(v->vtyp);
  953.   if(v->storage_class==STATIC){
  954.     if((v->vtyp->flags&NQ)==FUNKT) return;
  955.     if(v->clist&&(!constflag||(g_flags[2]&USEDFLAG))&§ion!=DATA){fprintf(f,dataname);section=DATA;}
  956.     if(v->clist&&constflag&&!(g_flags[2]&USEDFLAG)&§ion!=CODE){fprintf(f,codename);section=CODE;}
  957.     if(!v->clist&§ion!=BSS){fprintf(f,bssname);section=BSS;}
  958.     fprintf(f,"\t.type\t%s%ld,@object\n",labprefix,zl2l(v->offset));
  959.     fprintf(f,"\t.size\t%s%ld,%ld\n",labprefix,zl2l(v->offset),zl2l(szof(v->vtyp)));
  960.     if(section!=BSS) fprintf(f,"%s%ld:\n",labprefix,zl2l(v->offset));
  961.     else fprintf(f,"\t.lcomm\t%s%ld,",labprefix,zl2l(v->offset));
  962.     newobj=1;
  963.   }
  964.   if(v->storage_class==EXTERN){
  965.     fprintf(f,"\t.global\t%s%s\n",idprefix,v->identifier);
  966.     if(v->flags&(DEFINED|TENTATIVE)){
  967.       if(v->clist&&(!constflag||(g_flags[2]&USEDFLAG))&§ion!=DATA){fprintf(f,dataname);section=DATA;}
  968.       if(v->clist&&constflag&&!(g_flags[2]&USEDFLAG)&§ion!=CODE){fprintf(f,codename);section=CODE;}
  969.       if(!v->clist&§ion!=BSS){fprintf(f,bssname);section=BSS;}
  970.       fprintf(f,"\t.type\t%s%s,@object\n",idprefix,v->identifier);
  971.       fprintf(f,"\t.size\t%s%s,%ld\n",idprefix,v->identifier,zl2l(szof(v->vtyp)));
  972.       if(section!=BSS) fprintf(f,"%s%s:\n",idprefix,v->identifier);
  973.       else fprintf(f,"\t.comm\t%s%s,",idprefix,v->identifier);
  974.       newobj=1;
  975.     }
  976.   }
  977. }
  978.  
  979. void gen_dc(FILE *f,int t,struct const_list *p)
  980. /*  This function has to create static storage          */
  981. /*  initialized with const-list p.                      */
  982. {
  983.   if((t&NQ)==POINTER) t=UNSIGNED|LONG;
  984.   fprintf(f,"\t.%s\t",dct[t&NQ]);
  985.   if(!p->tree){
  986.     if((t&NQ)==FLOAT||(t&NQ)==DOUBLE){
  987.       /*  auch wieder nicht sehr schoen und IEEE noetig   */
  988.       unsigned char *ip;
  989.       ip=(unsigned char *)&p->val.vdouble;
  990.       fprintf(f,"0x%02x%02x%02x%02x",ip[3],ip[2],ip[1],ip[0]);
  991.       if((t&NQ)==DOUBLE){
  992.     fprintf(f,",0x%02x%02x%02x%02x",ip[7],ip[6],ip[5],ip[4]);
  993.       }
  994.     }else{
  995.       printval(f,&p->val,t&NU,0);
  996.     }
  997.   }else{
  998.     if(p->tree->o.am) ierror(9);
  999.     probj2(f,&p->tree->o,t&NU);
  1000.   }
  1001.   fprintf(f,"\n");newobj=0;
  1002. }
  1003.  
  1004.  
  1005. /*  The main code-generation routine.                   */
  1006. /*  f is the stream the code should be written to.      */
  1007. /*  p is a pointer to a doubly linked list of ICs       */
  1008. /*  containing the function body to generate code for.  */
  1009. /*  v is a pointer to the function.                     */
  1010. /*  offset is the size of the stackframe the function   */
  1011. /*  needs for local variables.                          */
  1012.  
  1013. void gen_code(FILE *f,struct IC *p,struct Var *v,zlong offset)
  1014. /*  The main code-generation.                                           */
  1015. {
  1016.   int addbuf,c,t,cmpreg,cmpflag,wasnoreg,i,varargs=0,fixargs;struct IC *m;
  1017.   long pushed,maxpushed;
  1018.   if(DEBUG&1) printf("gen_code()\n");
  1019.   if(stabs) debug_init(f,v);
  1020.   for(c=1;c<=MAXR;c++){regs[c]=regsa[c];st[c]=ESGN;}
  1021.   /* We do a pass over the code to retrieve some info and prepare certain optimizations */
  1022.   addbuf=0;maxpushed=0;
  1023.   for(m=p;m;m=m->next){
  1024.     c=m->code;t=m->typf&NU;
  1025.     if(c==ALLOCREG) {regs[m->q1.reg]=1;continue;}
  1026.     if(c==FREEREG) {regs[m->q1.reg]=0;continue;}
  1027.     if(c==COMPARE&&(m->q2.flags&KONST)){ 
  1028.       eval_const(&m->q2.val,t); 
  1029.       if(zleqto(vlong,l2zl(0L))&&zdeqto(vdouble,d2zd(0.0))){ 
  1030.      m->q2.flags=0;m->code=c=TEST; 
  1031.       } 
  1032.     } 
  1033.     if((t&NQ)<=LONG&&(m->q2.flags&KONST)&&(c==MULT||c==DIV||(c==MOD&&(t&UNSIGNED)))){ 
  1034.       eval_const(&m->q2.val,t); 
  1035.       i=pof2(vulong); 
  1036.       if(i){
  1037.      if(c==MOD){ 
  1038.        vlong=zlsub(vlong,l2zl(1L)); 
  1039.        m->code=AND; 
  1040.      }else{ 
  1041.        vlong=l2zl(i-1); 
  1042.        if(c==DIV) m->code=RSHIFT; else m->code=LSHIFT; 
  1043.      } 
  1044.      c=m->code; 
  1045.     if((t&NU)==CHAR) m->q2.val.vchar=zl2zc(vlong); 
  1046.     if((t&NU)==SHORT) m->q2.val.vshort=zl2zs(vlong); 
  1047.      if((t&NU)==INT) m->q2.val.vint=zl2zi(vlong); 
  1048.      if((t&NU)==LONG) m->q2.val.vlong=vlong; 
  1049.      vulong=zl2zul(vlong); 
  1050.      if((t&NU)==(UNSIGNED|CHAR)) m->q2.val.vuchar=zul2zuc(vulong); 
  1051.      if((t&NU)==(UNSIGNED|SHORT)) m->q2.val.vushort=zul2zus(vulong); 
  1052.      if((t&NU)==(UNSIGNED|INT))  m->q2.val.vuint=zul2zui(vulong); 
  1053.      if((t&NU)==(UNSIGNED|LONG)) m->q2.val.vulong=vulong; 
  1054.       } 
  1055.     } 
  1056.     /* Need one stack slot for transfrring between integer and floating-point registers. */
  1057.     t&=NQ;
  1058.     if(c==CONVDOUBLE&&t<=LONG&&addbuf<8) addbuf=8;
  1059.     if(c==CONVFLOAT&&t<=LONG&&addbuf<8) addbuf=8;
  1060. /*     if(t==DOUBLE&&c>=CONVCHAR&&c<=CONVLONG&&addbuf<8) addbuf=8; */
  1061. /*     if(t==FLOAT&&c>=CONVCHAR&&c<=CONVLONG&&addbuf<8) addbuf=8;  */
  1062.     if(t==DOUBLE&&c!=CONVFLOAT&&addbuf<8) addbuf=8;
  1063.     if(t==FLOAT&&c!=CONVDOUBLE&&addbuf<8) addbuf=8;  
  1064.     /* May need one stack slot for inline memcpy. */
  1065. /*     if((c==ASSIGN||c==PUSH)&&t>=POINTER&&addbuf<8) addbuf=8; */
  1066.     /* Need additional stack slots for passing function arguments. */
  1067.     if(c==CALL&&maxpushed<zl2l(m->q2.val.vlong)) maxpushed=zl2l(m->q2.val.vlong);
  1068.     if(c==CALL&&(m->q1.flags&VAR)&&!strcmp(m->q1.v->identifier,"__va_start")) varargs=1;
  1069.     /* Need up to 4 stack slots for calling div/mod-functions. */
  1070.     if((c==DIV||c==MOD)&&(p->typf&NQ)<=LONG&&addbuf<32){
  1071.       if(regs[25]||regs[26]||regs[28]||regs[29]) addbuf=32;
  1072.     }
  1073.   }
  1074.   /* Noch nicht ok. */
  1075.   if(varargs){
  1076.     fixargs=0;
  1077.     for(i=0;i<v->vtyp->exact->count;i++){
  1078.       c=(*v->vtyp->exact->sl)[i].styp->flags&NQ;
  1079.       if(c<=POINTER) fixargs++;
  1080.     }
  1081.     if(fixargs<6) addbuf+=(6-fixargs)*16;
  1082.   }
  1083.   function_top(f,v,zl2l(offset+addbuf),maxpushed);
  1084.   if(varargs){
  1085.     for(i=fixargs+1;i<=6;i++){
  1086.       fprintf(f,"\tstq\t%s,%d(%s)\n",regnames[16+i],framesize-(7-i)*16,regnames[sp]);
  1087.       fprintf(f,"\tstt\t%s,%d(%s)\n",regnames[48+i],framesize-(7-i)*16+8,regnames[sp]);
  1088.     }
  1089.   }
  1090.   pushed=0;
  1091.   for(;p;pr(f,p),p=p->next){
  1092.     if(DEBUG) pric2(stdout,p);
  1093.     if(stabs) debug_IC(f,p);
  1094.     c=p->code;t=p->typf;
  1095.     if(c==NOP) continue;
  1096.     if(c==ALLOCREG) {regs[p->q1.reg]=1;continue;}
  1097.     if(c==FREEREG) {regs[p->q1.reg]=0;continue;}
  1098.     if(c==LABEL||(c>=BEQ&&c<=BRA)){
  1099.       int i;
  1100.       for(i=1;i<=32;i++) 
  1101.     if(regs[i]&&!regsa[i]) extend(f,i);
  1102.     }
  1103.     if(c==LABEL) {fprintf(f,"%s%d:\n",labprefix,t);continue;}
  1104.     if(c==BRA) {fprintf(f,"\tbr\t%s%d\n",labprefix,t);continue;}
  1105.     if(c>=BEQ&&c<BRA){
  1106.       if(cmpflag){
  1107.     fprintf(f,"\t%sb%s\t%s,%s%d\n",cmpreg<=32?"":"f",cmpflag<0?"eq":"ne",regnames[cmpreg],labprefix,t);
  1108.       }else{
  1109.     fprintf(f,"\t%sb%s\t%s,%s%d\n",cmpreg<=32?"":"f",ccs[c-BEQ],regnames[cmpreg],labprefix,t);
  1110.       }
  1111.       continue;
  1112.     }
  1113.     if(c==MOVETOREG){
  1114.       load_reg(f,p->z.reg,&p->q1,p->z.reg<=32?LONG:DOUBLE,0);
  1115.       p->z.flags=0;
  1116.       continue;
  1117.     }
  1118.     if(c==MOVEFROMREG){
  1119.       store_reg(f,p->q1.reg,&p->z,p->q1.reg<=32?LONG:DOUBLE);
  1120.       p->z.flags=0;
  1121.       continue;
  1122.     }
  1123.     if((t&NQ)==POINTER) t=(t-POINTER+LONG)|UNSIGNED;
  1124.     if((c==ASSIGN||c==PUSH)&&((t&NQ)>POINTER||((t&NQ)==CHAR&&zl2l(p->q2.val.vlong)!=1))){
  1125.       zlong size; struct obj loops;
  1126.       int salign,dalign,cl,a1,a2,mr,ms;
  1127.       size=p->q2.val.vlong;
  1128.       salign=balign(&p->q1);
  1129.       if(c==PUSH) dalign=0; else dalign=balign(&p->z);
  1130.       if(salign>=0&&dalign>=0&&(salign&3)==(dalign&3)){
  1131.     a1=t1; a2=t2;
  1132.       }else{
  1133.     if(!helpl) helpl=++label;
  1134.     cl=0;mr=0;ms=0;
  1135.     for(i=1;i<=32;i++){
  1136.       if(i!=17&&i!=18&&i!=19&®used[i]&&!regscratch[i]&&!regs[i]) mr=i;
  1137.       if(regs[i]&®scratch[i]) ms=1;
  1138.     }
  1139.     if(mr==0) mr=t3;
  1140.     if(regs[17]||regs[18]||regs[19]||function_calls==0) ms=1;
  1141.     if(ms) fprintf(f,"\tlda\t%s,%s%d\n",regnames[mr],labprefix,helpl);
  1142.     if(regs[17]) fprintf(f,"\tstq\t%s,%d(%s)\n",regnames[17],8*cl++,regnames[mr]);
  1143.     if(regs[18]) fprintf(f,"\tstq\t%s,%d(%s)\n",regnames[18],8*cl++,regnames[mr]);
  1144.     if(regs[19]) fprintf(f,"\tstq\t%s,%d(%s)\n",regnames[19],8*cl++,regnames[mr]);
  1145.     a1=18;a2=17;
  1146.     if(p->z.am&&p->z.am->base==18) ierror(0);
  1147.     if(!p->z.am&&(p->z.flags®)&&p->z.reg==18) ierror(0);
  1148.       }
  1149.       if(p->q1.flags&DREFOBJ){
  1150.     p->q1.flags&=~DREFOBJ;
  1151.     load_reg(f,a1,&p->q1,POINTER,a1);
  1152.     p->q1.flags|=DREFOBJ;
  1153.       }else{
  1154.     load_address(f,a1,&p->q1,POINTER);
  1155.       }
  1156.       if(p->z.flags&DREFOBJ){
  1157.     p->z.flags&=~DREFOBJ;
  1158.     load_reg(f,a2,&p->z,POINTER,a2);
  1159.     p->z.flags|=DREFOBJ;
  1160.       }else{
  1161.     if(c==PUSH){
  1162.       fprintf(f,"\tlda\t%s,%ld(%s)\n",regnames[a2],pushed,regnames[sp]);
  1163.       pushed+=zl2l(p->q2.val.vlong);
  1164.     }else{
  1165.       load_address(f,a2,&p->z,POINTER);
  1166.     }
  1167.       }
  1168.       if(salign>=0&&dalign>=0&&(salign&3)==(dalign&3)){
  1169.     int do64,m,s;
  1170.     if((salign&7)==(dalign&7)) 
  1171.       {do64=1;m=8;s='q';}
  1172.     else
  1173.       {do64=0;m=4;s='l';salign&=3;}
  1174.     if(salign&7){
  1175.       fprintf(f,"\tld%c\t%s,%d(%s)\n",s,regnames[t3],-salign,regnames[t1]);
  1176.       fprintf(f,"\tld%c\t%s,%d(%s)\n",s,regnames[t4],-salign,regnames[t2]);
  1177.       cl=(1<<salign)-1;
  1178.       if(!zlleq(l2zl(m-salign),size)) cl+=((1<<(m-salign-zl2l(size)))-1)<<(salign+zl2l(size));
  1179.       fprintf(f,"\tzap\t%s,%d,%s\n",regnames[t3],cl,regnames[t3]);
  1180.       fprintf(f,"\tzapnot\t%s,%d,%s\n",regnames[t4],cl,regnames[t4]);
  1181.       fprintf(f,"\tbis\t%s,%s,%s\n",regnames[t3],regnames[t4],regnames[t3]);
  1182.       fprintf(f,"\tst%c\t%s,%d(%s)\n",s,regnames[t3],-salign,regnames[t2]);
  1183.       size=zlsub(size,zl2l(m-salign));
  1184.       salign=m-salign;
  1185.     }else 
  1186.       salign=0;
  1187.     loops.val.vlong=zldiv(size,l2zl(8*m));
  1188.     if(zlleq(l2zl(2L),loops.val.vlong)){
  1189.       loops.flags=KONST;
  1190.       loops.am=0;
  1191.       load_reg(f,t3,&loops,LONG,t3);
  1192.       cl=++label;
  1193.       fprintf(f,"\t.align\t4\n%s%d:\n",labprefix,cl);
  1194.     }
  1195.     if(!zleqto(loops.val.vlong,l2zl(0))){
  1196.       for(i=0;i<8;i+=2){
  1197.         fprintf(f,"\tld%c\t%s,%d(%s)\n",s,regnames[t4],salign+i*m,regnames[t1]);
  1198.         fprintf(f,"\tld%c\t%s,%d(%s)\n",s,regnames[t5],salign+i*m+m,regnames[t1]);
  1199.         fprintf(f,"\tst%c\t%s,%d(%s)\n",s,regnames[t4],salign+i*m,regnames[t2]);
  1200.         fprintf(f,"\tst%c\t%s,%d(%s)\n",s,regnames[t5],salign+i*m+m,regnames[t2]);
  1201.       }
  1202.     }
  1203.     if(zlleq(l2zl(2L),loops.val.vlong)){
  1204.       fprintf(f,"\taddq\t%s,%d,%s\n",regnames[t1],8*m,regnames[t1]);
  1205.       fprintf(f,"\taddq\t%s,%d,%s\n",regnames[t2],8*m,regnames[t2]);
  1206.       fprintf(f,"\tsubq\t%s,1,%s\n",regnames[t3],regnames[t3]);
  1207.       fprintf(f,"\tbne\t%s,%s%d\n",regnames[t3],labprefix,cl);
  1208.     }else{
  1209.       if(!zleqto(loops.val.vlong,l2zl(0L)))
  1210.         salign+=8*m;
  1211.     }
  1212.     size=zland(size,l2zl(8*m-1));
  1213.     for(i=0;i<(zl2l(size)/m/2)*2;i+=2){
  1214.       fprintf(f,"\tld%c\t%s,%d(%s)\n",s,regnames[t4],salign+i*m,regnames[t1]);
  1215.       fprintf(f,"\tld%c\t%s,%d(%s)\n",s,regnames[t5],salign+i*m+m,regnames[t1]);
  1216.       fprintf(f,"\tst%c\t%s,%d(%s)\n",s,regnames[t4],salign+i*m,regnames[t2]);
  1217.       fprintf(f,"\tst%c\t%s,%d(%s)\n",s,regnames[t5],salign+i*m+m,regnames[t2]);      
  1218.     }
  1219.     size=zland(size,l2zl(2*m-1));
  1220.     if(zl2l(size)>=m){
  1221.       fprintf(f,"\tld%c\t%s,%d(%s)\n",s,regnames[t4],salign+i*m,regnames[t1]);
  1222.       fprintf(f,"\tst%c\t%s,%d(%s)\n",s,regnames[t4],salign+i*m,regnames[t2]);
  1223.       size=zlsub(size,l2zl(m));i++;
  1224.     }
  1225.     if(zl2l(size)>0){
  1226.       if(zl2l(size)==4){
  1227.         fprintf(f,"\tldl\t%s,%d(%s)\n",regnames[t4],salign+i*m,regnames[t1]);
  1228.         fprintf(f,"\tstl\t%s,%d(%s)\n",regnames[t4],salign+i*m,regnames[t2]);
  1229.       }else{
  1230.         fprintf(f,"\tld%c\t%s,%d(%s)\n",s,regnames[t4],salign+i*m,regnames[t1]);
  1231.         fprintf(f,"\tld%c\t%s,%d(%s)\n",s,regnames[t5],salign+i*m,regnames[t2]);
  1232.         cl=(1<<zl2l(size))-1;      
  1233.         fprintf(f,"\tzapnot\t%s,%d,%s\n",regnames[t4],cl,regnames[t4]);
  1234.         fprintf(f,"\tzap\t%s,%d,%s\n",regnames[t5],cl,regnames[t5]);
  1235.         fprintf(f,"\tbis\t%s,%s,%s\n",regnames[t4],regnames[t5],regnames[t4]);
  1236.         fprintf(f,"\tst%c\t%s,%d(%s)\n",s,regnames[t4],salign+i*m,regnames[t2]);
  1237.       }
  1238.     }
  1239.     p->z.flags=0; /* to prevent pr() from... */
  1240.     continue;
  1241.       } 
  1242.       for(i=1;i<=32;i++){
  1243.     if(i!=17&&i!=18&&i!=19&®s[i]&®scratch[i])
  1244.       fprintf(f,"\tstq\t%s,%d(%s)\n",regnames[i],8*cl++,regnames[mr]);
  1245.       }
  1246.       if(function_calls==0) fprintf(f,"\tstq\t%s,%d(%s)\n",regnames[lr],8*cl++,regnames[mr]);
  1247.       if(cl>helps) helps=cl;
  1248.       loops.val.vlong=size;
  1249.       loops.flags=KONST;
  1250.       loops.am=0;
  1251.       load_reg(f,19,&loops,LONG,19);
  1252.       fprintf(f,"\t.global\t%smemcpy\n",idprefix);
  1253.       fprintf(f,"\tjsr\t%s,%smemcpy\n",regnames[lr],idprefix);
  1254.       fprintf(f,"\tldgp\t%s,0(%s)\n",regnames[gp],regnames[lr]);
  1255.       cl=0;
  1256.       if(ms&&mr==t3) fprintf(f,"\tlda\t%s,%s%d\n",regnames[mr],labprefix,helpl);
  1257.       if(regs[17]) fprintf(f,"\tldq\t%s,%d(%s)\n",regnames[17],8*cl++,regnames[mr]);
  1258.       if(regs[18]) fprintf(f,"\tldq\t%s,%d(%s)\n",regnames[18],8*cl++,regnames[mr]);
  1259.       if(regs[19]) fprintf(f,"\tldq\t%s,%d(%s)\n",regnames[19],8*cl++,regnames[mr]);
  1260.       for(i=1;i<=32;i++){
  1261.     if(i!=17&&i!=18&&i!=19&®s[i]&®scratch[i])
  1262.       fprintf(f,"\tldq\t%s,%d(%s)\n",regnames[i],8*cl++,regnames[mr]);
  1263.       }
  1264.       if(function_calls==0) fprintf(f,"\tldq\t%s,%d(%s)\n",regnames[lr],8*cl++,regnames[mr]);     
  1265.       p->z.flags=0;
  1266.       continue;
  1267.     }
  1268.     if(isreg(q1)) wasnoreg=1; else wasnoreg=0;
  1269.     p=do_refs(f,p);
  1270.     c=p->code;
  1271.     if(c>=CONVCHAR&&c<=CONVULONG){
  1272.       int to;
  1273.       if(c==CONVCHAR) to=CHAR;
  1274.       if(c==CONVUCHAR) to=UNSIGNED|CHAR;
  1275.       if(c==CONVSHORT) to=SHORT;
  1276.       if(c==CONVUSHORT) to=UNSIGNED|SHORT;
  1277.       if(c==CONVINT) to=LONG;
  1278.       if(c==CONVUINT) to=UNSIGNED|LONG;
  1279.       if(c==CONVLONG) to=LONG;
  1280.       if(c==CONVULONG) to=UNSIGNED|LONG;
  1281.       if(c==CONVFLOAT) to=FLOAT;
  1282.       if(c==CONVDOUBLE) to=DOUBLE;
  1283.       if(c==CONVPOINTER) to=UNSIGNED|LONG;
  1284.       if((to&NQ)<=LONG&&(t&NQ)<=LONG){
  1285.     if((to&NQ)>=(t&NQ)){
  1286.       if((t&NQ)<INT){
  1287.         if(to&UNSIGNED){
  1288.           fprintf(f,"\tzapnot\t%s,%d,%s\n",regnames[q1reg],(t&NQ)==CHAR?1:3,regnames[zreg]);
  1289.           st[zreg]=EUNS;continue;
  1290.         }else{
  1291.           fprintf(f,"\tsext%c\t%s,%s\n",(t&NQ)==CHAR?'b':'w',regnames[q1reg],regnames[zreg]);
  1292.           st[zreg]=ESGN;continue;
  1293.         }
  1294.       }
  1295.       zreg=q1reg;
  1296.     }else if((t&NQ)==LONG){
  1297.       if(to&UNSIGNED)
  1298.         uextend(f,q1reg);
  1299.       else
  1300.         extend(f,q1reg);
  1301.       st[q1reg]=ESGN;
  1302.       zreg=q1reg;
  1303.     }else
  1304.       zreg=q1reg;
  1305.     continue;
  1306.       }
  1307.       if(to==FLOAT||to==DOUBLE){
  1308.     st[zreg]=ESGN;
  1309.     if((t&NQ)==FLOAT||(t&NQ)==DOUBLE){
  1310.       fprintf(f,"\tcvt%c%c\t%s,%s\n",x_t[to&NQ],x_t[t&NQ],regnames[q1reg],regnames[zreg]);
  1311.       continue;
  1312.     }
  1313. /*     if(t&UNSIGNED) ierror(0); */
  1314.     fprintf(f,"\tcvttqc\t%s,%s\n",regnames[q1reg],regnames[f3]);
  1315. /*     fprintf(f,"\tftoit\t%s,%s\n",regnames[q1reg],regnames[zreg]);  */
  1316. /*     fprintf(f,"\t.long\t%ld\n",(0x1cl<<26)+(0x70l<<5)+(31l<<16)+((long)(q1reg-33)<<21)+zreg-1); */
  1317.     fprintf(f,"\tstt\t%s,%ld(%s)\n",regnames[f3],framesize-addbuf,regnames[sp]);
  1318.     fprintf(f,"\tldq\t%s,%ld(%s)\n",regnames[zreg],framesize-addbuf,regnames[sp]);
  1319.     st[zreg]=ESGN;
  1320.     continue;
  1321.       }
  1322.       if((t&NQ)==FLOAT||(t&NQ)==DOUBLE){
  1323. /*     if(to&UNSIGNED) ierror(0); */
  1324. /*     fprintf(f,"\titoft\t%s,%s\n",regnames[q1reg],regnames[zreg]);  */
  1325.     fprintf(f,"\tstq\t%s,%ld(%s)\n",regnames[q1reg],framesize-addbuf,regnames[sp]);
  1326.     fprintf(f,"\tldt\t%s,%ld(%s)\n",regnames[zreg],framesize-addbuf,regnames[sp]);
  1327.     fprintf(f,"\tcvtq%c\t%s,%s\n",x_t[t&15],regnames[zreg],regnames[zreg]);
  1328.  
  1329.     continue;
  1330.       }
  1331.     }
  1332.     if(c==KOMPLEMENT){      
  1333.       fprintf(f,"\tornot\t%s,%s,%s\n",regnames[r31],regnames[q1reg],regnames[zreg]);
  1334.       if((t&NQ)==INT) st[zreg]=0; else st[zreg]=ESGN;
  1335.       continue;
  1336.     }
  1337.     if(c==SETRETURN){
  1338.       if(p->z.reg){
  1339.     if(zreg==0) load_reg(f,p->z.reg,&p->q1,t,t3);
  1340.     extend(f,p->z.reg);
  1341.       }else
  1342.     ierror(0);
  1343.       continue;
  1344.     }
  1345.     if(c==GETRETURN){
  1346.       if(p->q1.reg){
  1347.     zreg=p->q1.reg;
  1348.     st[zreg]=ESGN;
  1349.       }else
  1350.     p->z.flags=0;
  1351.       continue;
  1352.     }
  1353.     if(c==CALL){
  1354.       int reg;
  1355.       if((p->q1.flags&VAR)&&p->q1.v->fi&&p->q1.v->fi->inline_asm){
  1356.     fprintf(f,"%s\n",p->q1.v->fi->inline_asm);
  1357.     pushed-=zl2l(p->q2.val.vlong);
  1358.     continue;
  1359.       }
  1360.       if((p->q1.flags&VAR)&&p->q1.v->storage_class==EXTERN&&!(g_flags[6]&USEDFLAG)){
  1361.     char *s=p->q1.v->identifier;
  1362.     if(!strcmp("abs",s)||!strcmp("labs",s)){
  1363.       fprintf(f,"\tsubq\t%s,%s,%s\n",regnames[r31],regnames[17],regnames[1]);
  1364.       fprintf(f,"\tcmovge\t%s,%s,%s\n",regnames[17],regnames[17],regnames[1]);
  1365.       continue;
  1366.     }
  1367.     if(!strcmp("fabs",s)){
  1368.       fprintf(f,"\tfabs\t%s,%s\n",regnames[17],regnames[1]);
  1369.       continue;
  1370.     }
  1371.     if(!strcmp("__va_fixargs",s)){
  1372.       fprintf(f,"\tlda\t%s,%d(%s)\n",regnames[1],fixargs,regnames[r31]);
  1373.       continue;
  1374.     }
  1375.     if(!strcmp("__va_start",s)){
  1376.       fprintf(f,"\tlda\t%s,%d(%s)\n",regnames[1],framesize-(6-fixargs)*16,regnames[sp]);
  1377.       continue;
  1378.     }
  1379.       }
  1380.       for(reg=17;reg<=22;reg++)
  1381.     extend(f,reg);
  1382.       if(q1reg){
  1383.     if(q1reg!=vp) move_reg(f,q1reg,vp);
  1384.     fprintf(f,"\tjsr\t%s,(%s),0\n",regnames[lr],regnames[vp]);
  1385.       }else{
  1386.     fprintf(f,"\tjsr\t%s,",regnames[lr]);
  1387.     probj2(f,&p->q1,t);fprintf(f,"\n");
  1388.       }
  1389.       fprintf(f,"\tldgp\t%s,0(%s)\n",regnames[gp],regnames[lr]);
  1390.       pushed-=zl2l(p->q2.val.vlong);
  1391.       continue;
  1392.     }
  1393.     if(c==ASSIGN||c==PUSH){
  1394.       if(t==0) ierror(0);
  1395.       if(q1reg){
  1396.     if(c==PUSH){
  1397.       extend(f,q1reg);
  1398.       if((t&NQ)==FLOAT){
  1399.         fprintf(f,"\tcvtst\t%s,%s\n",regnames[q1reg],regnames[f1]);
  1400.         q1reg=f1;
  1401.       }
  1402.       fprintf(f,"\tst%c\t%s,%ld(%s)\n",q1reg<=32?'q':'t',regnames[q1reg],pushed,regnames[sp]);
  1403.       pushed+=8;
  1404.       continue;
  1405.     }
  1406.     if(c==ASSIGN) zreg=q1reg;
  1407.     continue;
  1408.       }else ierror(0);
  1409.     }
  1410.     if(c==ADDRESS){
  1411.       load_address(f,zreg,&p->q1,POINTER);
  1412.       continue;
  1413.     }
  1414.     if(c==MINUS){
  1415.       if((t&NQ)<=LONG)
  1416.     fprintf(f,"\tsub%c\t%s,%s,%s\n",x_t[t&NQ],regnames[r31],regnames[q1reg],regnames[zreg]);
  1417.       else
  1418.     fprintf(f,"\tsub%c\t%s,%s,%s\n",x_t[t&NQ],regnames[f31],regnames[q1reg],regnames[zreg]);
  1419.       st[zreg]=ESGN;
  1420.       continue;
  1421.     }
  1422.     if(c==TEST){
  1423.       if(st[q1reg]==0) extend(f,q1reg);
  1424.       cmpreg=q1reg;
  1425.       cmpflag=0;
  1426.       continue;
  1427.     }
  1428.     if(c==COMPARE){
  1429.       struct IC *br=p->next;
  1430.       while(1){
  1431.     if(br->code>=BEQ&&br->code<BRA) break;
  1432.     if(br->code!=FREEREG) ierror(0);
  1433.     br=br->next;
  1434.       }      
  1435.       if((t&NQ)==FLOAT||(t&NQ)==DOUBLE) cmpreg=f3; else cmpreg=t3;
  1436.       if(br->code==BEQ||br->code==BNE){
  1437.     if((t&NU)==(UNSIGNED|INT)){
  1438.       if(st[q1reg]==ESGN) extend(f,q2reg);
  1439.       else if(st[q2reg]==ESGN) extend(f,q1reg);
  1440.       else if(st[q1reg]==EUNS) uextend(f,q2reg);
  1441.       else if(st[q2reg]==EUNS) uextend(f,q1reg);
  1442.       else {extend(f,q1reg);extend(f,q2reg);}
  1443.     }
  1444.     if((t&NU)==INT){extend(f,q1reg);extend(f,q2reg);}      
  1445.     if((t&NQ)==FLOAT||(t&NQ)==DOUBLE) fprintf(f,"\tsub%c\t%s,",x_t[t&NQ],regnames[q1reg]);
  1446.       else fprintf(f,"\tsub%c\t%s,",x_t[t&NQ],regnames[q1reg]);
  1447.     probj2(f,&p->q2,t);fprintf(f,",%s\n",regnames[cmpreg]);
  1448.     cmpflag=0;st[cmpreg]=ESGN;
  1449.       }else{
  1450.     char *s="";
  1451.     if(t&UNSIGNED) s="u";
  1452.     if((t&NU)==(UNSIGNED|INT)){uextend(f,q1reg);uextend(f,q2reg);}
  1453.     if((t&NU)==INT){extend(f,q1reg);extend(f,q2reg);}
  1454.     if((t&NQ)==FLOAT||(t&NQ)==DOUBLE) s="t";
  1455.     if(br->code==BLT||br->code==BGE){
  1456.       fprintf(f,"\tcmp%slt\t%s,",s,regnames[q1reg]);
  1457.       probj2(f,&p->q2,t);fprintf(f,",%s\n",regnames[cmpreg]);
  1458.       if(br->code==BGE) cmpflag=-1; else cmpflag=1;
  1459.     }else{
  1460.       fprintf(f,"\tcmp%sle\t%s,",s,regnames[q1reg]);
  1461.       probj2(f,&p->q2,t);fprintf(f,",%s\n",regnames[cmpreg]);
  1462.       if(br->code==BGT) cmpflag=-1; else cmpflag=1;
  1463.     }
  1464.       }
  1465.       continue;
  1466.     }
  1467.     if(c>=OR&&c<=AND){
  1468.       fprintf(f,"\t%s\t%s,",logicals[c-OR],regnames[q1reg]);
  1469.       probj2(f,&p->q2,t);fprintf(f,",%s\n",regnames[zreg]);
  1470.       /* hier ist mehr moeglich */
  1471.       if((t&NQ)==INT) st[zreg]=0; else st[zreg]=ESGN;
  1472.       continue;
  1473.     }
  1474.     if(c>=LSHIFT&&c<=MOD){
  1475.       int xt;
  1476.       if(c==LSHIFT&&(p->q2.flags&KONST)){
  1477.     eval_const(&p->q2.val,t);
  1478.     if(zuleqto(vulong,ul2zul(1UL))){
  1479.       fprintf(f,"\tadd%c\t%s,%s,%s\n",x_t[t&NQ],regnames[q1reg],regnames[q1reg],regnames[zreg]);
  1480.       st[zreg]=ESGN;continue;
  1481.     }
  1482.     if(zuleqto(vulong,ul2zul(2UL))){
  1483.       fprintf(f,"\ts4add%c\t%s,0,%s\n",x_t[t&NQ],regnames[q1reg],regnames[zreg]);
  1484.       st[zreg]=ESGN;continue;
  1485.     }
  1486.     if(zuleqto(vulong,ul2zul(3UL))){
  1487.       fprintf(f,"\ts8add%c\t%s,0,%s\n",x_t[t&NQ],regnames[q1reg],regnames[zreg]);
  1488.       st[zreg]=ESGN;continue;
  1489.     }
  1490.       }
  1491.       if(c==RSHIFT||c==LSHIFT){
  1492.     if(c==RSHIFT){
  1493.       if(t&UNSIGNED){
  1494.         if((t&NQ)<LONG) uextend(f,q1reg);
  1495.         fprintf(f,"\tsrl\t");
  1496.       }else{
  1497.         extend(f,q1reg);
  1498.         fprintf(f,"\tsra\t");
  1499.       }
  1500.       st[zreg]=st[q1reg];
  1501.     }else{
  1502.       fprintf(f,"\tsll\t");
  1503.       if((t&NQ)<=INT) st[zreg]=0; else st[zreg]=ESGN;
  1504.     }
  1505.     fprintf(f,"%s,",regnames[q1reg]);
  1506.     probj2(f,&p->q2,t);fprintf(f,",%s\n",regnames[zreg]);
  1507.     continue;
  1508.       }
  1509.       if((c==DIV||c==MOD)&&(t&NQ)<=LONG){
  1510.     /* Linux-Routinen aufrufen. q1=$24 q2=$25 z=$27 $28 scratch */
  1511.     if(!q1reg) ierror(0);
  1512.     if(q1reg!=25){
  1513.       if(regs[25]) fprintf(f,"\tstq\t%s,%ld(%s)\n",regnames[25],framesize-addbuf,regnames[sp]);
  1514.       move_reg(f,q1reg,25);
  1515.     }
  1516.     if(q2reg!=26&®s[26]) fprintf(f,"\tstq\t%s,%ld(%s)\n",regnames[26],framesize-addbuf+8,regnames[sp]);
  1517.     if(q2reg==25) 
  1518.       fprintf(f,"\tldq\t%s,%ld(%s)\n",regnames[26],framesize-addbuf,regnames[sp]);
  1519.     else
  1520.       load_reg(f,26,&p->q2,t,26);
  1521.     if(zreg!=28&®s[28]) fprintf(f,"\tstq\t%s,%ld(%s)\n",regnames[28],framesize-addbuf+16,regnames[sp]);
  1522.     if(regs[29]) fprintf(f,"\tstq\t%s,%ld(%s)\n",regnames[29],framesize-addbuf+24,regnames[sp]);
  1523.     fprintf(f,"\t%sq%s\t%s,%s,%s\n",arithmetics[c-LSHIFT],(t&UNSIGNED)?"u":"",regnames[25],regnames[26],regnames[28]);
  1524.     if(zreg!=28) move_reg(f,28,zreg);
  1525.     if(q1reg!=25&®s[25]) fprintf(f,"\tldq\t%s,%ld(%s)\n",regnames[25],framesize-addbuf,regnames[sp]);
  1526.     if(q2reg!=26&®s[26]) fprintf(f,"\tldq\t%s,%ld(%s)\n",regnames[26],framesize-addbuf+8,regnames[sp]);
  1527.     if(zreg!=28&®s[28]) fprintf(f,"\tldq\t%s,%ld(%s)\n",regnames[28],framesize-addbuf+16,regnames[sp]);
  1528.     if(regs[29]) fprintf(f,"\tldq\t%s,%ld(%s)\n",regnames[29],framesize-addbuf+24,regnames[sp]);
  1529.     /* Was fuer st[zreg]? */
  1530.     continue;
  1531.       }
  1532.       xt=x_t[t&NQ];
  1533.       if((t&NQ)<INT) xt='l';
  1534.       fprintf(f,"\t%s%c\t%s,",arithmetics[c-LSHIFT],xt,regnames[q1reg]);
  1535.       probj2(f,&p->q2,t);fprintf(f,",%s\n",regnames[zreg]);
  1536.       st[zreg]=ESGN;
  1537.       continue;
  1538.     }
  1539.     if(c==SUBPFP){
  1540.       fprintf(f,"\tsubq\t%s,%s,%s\n",regnames[q1reg],regnames[q2reg],regnames[zreg]);
  1541.       st[zreg]=ESGN;continue;
  1542.     }
  1543.     if(c==ADDI2P||c==SUBIFP){
  1544.       if(t&UNSIGNED){
  1545.     if((t&NQ)<LONG) uextend(f,q2reg); 
  1546.       }else
  1547.     extend(f,q2reg);
  1548.       if(c==ADDI2P) fprintf(f,"\taddq\t%s,",regnames[q1reg]); 
  1549.       else fprintf(f,"\tsubq\t%s,",regnames[q1reg]);
  1550.       probj2(f,&p->q2,t);
  1551.       fprintf(f,",%s\n",regnames[zreg]);
  1552.       st[zreg]=ESGN;continue;
  1553.     }
  1554.     ierror(0);
  1555.   }  
  1556.   function_bottom(f,v,zl2l(offset+addbuf),maxpushed);
  1557.   if(stabs) debug_exit(f,v);
  1558. }
  1559.  
  1560. int shortcut(int code,int typ)
  1561. {
  1562.   return(0);
  1563. }
  1564.  
  1565. int reg_parm(struct reg_handle *m, struct Typ *t)
  1566. {
  1567.   int f;
  1568.   f=t->flags&NQ;
  1569.   if(f<=LONG||f==POINTER){
  1570.     if(m->nextr>=6) return(0);
  1571.     return(17+m->nextr++);
  1572.   }
  1573.   if(f==FLOAT||f==DOUBLE){
  1574.     if(m->nextr>=6) return(0);
  1575.     return(49+m->nextr++);
  1576.   }
  1577.   return(0);
  1578. }
  1579. void cleanup_cg(FILE *f)
  1580. {
  1581.   struct fpconstlist *p;
  1582.   unsigned char *ip;
  1583.   if(f&&stabs) debug_cleanup(f);
  1584.   while(p=firstfpc){
  1585.     if(f){
  1586.       int t=p->typ&NQ;
  1587.       if(section!=CODE){fprintf(f,codename);section=CODE;}
  1588.       fprintf(f,"\t.align\t3\n%s%d:\n\t",labprefix,p->label);
  1589.       if(t==FLOAT||t==DOUBLE){
  1590.     ip=(unsigned char *)&p->val.vdouble;
  1591.     fprintf(f,"\t.long\t0x%02x%02x%02x%02x",ip[3],ip[2],ip[1],ip[0]);
  1592.     if((p->typ&NQ)==DOUBLE){
  1593.       fprintf(f,",0x%02x%02x%02x%02x",ip[7],ip[6],ip[5],ip[4]);
  1594.     }
  1595.       }else{
  1596.     fprintf(f,"\t.quad\t",dct[t]);
  1597.     printval(f,&p->val,p->typ,0);
  1598.       }
  1599.       fprintf(f,"\n");
  1600.     }
  1601.     firstfpc=p->next;
  1602.     free(p);
  1603.   }
  1604.   if(f&&helps) fprintf(f,"\t.lcomm\t%s%d,%d\n",labprefix,helpl,helps*8);
  1605. }
  1606.  
  1607.  
  1608.